constraint n. 1.強(qiáng)迫,拘束。 2.約束,壓抑,拘泥。 3.強(qiáng)制力。 4.緊張感[狀態(tài)]。 by constraint 勉強(qiáng),強(qiáng)迫。 feel constraint覺(jué)得局促不安,感受壓迫。 show constraint顯得局促。 under [in] constraint 被迫,不得不;被束縛著。
We construct cost function which combines the likelihood function and boundary constraint function 它利用似然函數(shù)和邊界約束方程構(gòu)造代價(jià)函數(shù),來(lái)描述區(qū)域特征。
Finally , fuzzy chance - constrained programming provides a powerful means to deal with the intractable constraints functions such as those of generation companies " output 最后,提出將發(fā)電機(jī)出力等難以處理的不等約束轉(zhuǎn)換為模糊機(jī)會(huì)約束的思路。
By reviewing the history course of soe ' s reform , deeply analyze the promotion and constraint function of government , elaborate how the government affect the reform of soe 其次,在對(duì)我國(guó)國(guó)企改革過(guò)程政企關(guān)系的歷史回顧的基礎(chǔ)上,深入地分析了政府在國(guó)有企業(yè)改革中的促進(jìn)與制約作用,闡明了政府是如何影響國(guó)有企業(yè)改革的。
The multi - objective decision problem was transformed to the mono - objective problem by the multiply - divide method , and its constraint functions were transformed to the objective functions by a multiplication penalty function 使用化多為一的乘除法,將該多目標(biāo)決策問(wèn)題轉(zhuǎn)化為單目標(biāo)問(wèn)題求解,提出了使用乘法形式的罰函數(shù)將模型中的約束函數(shù)轉(zhuǎn)化為目標(biāo)函數(shù)。
To provide a dependable pattern for function decomposition , a new function analysis method was put forward based on the generalized process function along with the introduction of the input constraint function ; and its five - decomposition - steps were also presented 為了給功能分解提供可以遵循的模式,提出了基于工藝功能分析的方法,引入了輸入約束功能的概念,并給出了功能分解的5個(gè)詳細(xì)步驟。
Effective approaches are put forward which to define hierarchical levels of design parameters , classify along with dynamic and intelligent solve various engineering design constraints , and parameters information database , dimension constraint functions database and knowledge constraint database are establishes 文中對(duì)設(shè)計(jì)參數(shù)的層次化定義、約束的分類(lèi)及其動(dòng)態(tài)化和智能化處理提出了有效的解決方案,并建立了參數(shù)信息數(shù)據(jù)庫(kù)、尺寸約束函數(shù)庫(kù)和知識(shí)約束庫(kù)。
The author attempt to analyze the intercultural business negotiation process from a perspective of the relationship between culture context and intercultural business negotiation , and explores the function of cultural context within the four dimensions - interpretation function , constraint function , repairing function and choice of utterance function 因此,談判者在使用語(yǔ)言時(shí),可以根據(jù)交際場(chǎng)合的需要,激活相關(guān)的認(rèn)知語(yǔ)境要素,使之投入運(yùn)作,讓談判得以順暢進(jìn)行。
( 3 ) optimization design principle of long - short - pile composite foundation is put forward , base on which replacement ratio and pile length is taken as design variable , bearing capacity , settlement , stratum strength and other demands acted as constraint function , pile cost taken as objective function , so the optimization design model of long - short - pile composite foundation is built ( 3 )提出了長(zhǎng)短樁復(fù)合地基優(yōu)化設(shè)計(jì)原理,在此基礎(chǔ)上將置換率和樁長(zhǎng)作為設(shè)計(jì)變量,承載力、沉降、下臥層強(qiáng)度等要求作為約束函數(shù),總制樁費(fèi)用作為目標(biāo)函數(shù),建立出長(zhǎng)短樁復(fù)合地基優(yōu)化設(shè)計(jì)數(shù)學(xué)模型。
Secondly , a non - linear mapping function from multiple inputs ( design variables ) to output ( maximum dynamic stress ) is constructed within bp neural networks , in order to obtain the constraint function values that are necessary in optimum design of structures using genetic algorithms and get the optimum solutions . the generation ability of the bp network after training can be used to replace the calculation of fem , which makes the constrained optimization to be possible 其次,由于動(dòng)應(yīng)力的有限元法計(jì)算過(guò)程復(fù)雜,計(jì)算量巨大,在應(yīng)用優(yōu)化算法時(shí),需要反復(fù)計(jì)算,為了使優(yōu)化過(guò)程可行,設(shè)計(jì)了bp神經(jīng)網(wǎng)絡(luò),利用有限元計(jì)算的樣本數(shù)據(jù)建立起結(jié)構(gòu)設(shè)計(jì)參數(shù)(輸入)與動(dòng)應(yīng)力(輸出)的非線(xiàn)性映射關(guān)系,從而代替有限元法,快速計(jì)算結(jié)構(gòu)動(dòng)應(yīng)力。
Abstract firstly , convert a programming problem with multiple constraints into a programming problem with single constraint , secondly , several convexification and concavification transformations for the constrained problem with strictly monotone constraint functions are proposed according to the transformed problem with single constraint , then this constrained programming problem can be converted into a concave minimization or a reverse convex programming problem 摘要首先將一個(gè)具有多個(gè)約束的規(guī)劃問(wèn)題轉(zhuǎn)化為一個(gè)只有一個(gè)約束的規(guī)劃問(wèn)題,然后通過(guò)利用這個(gè)單約束的規(guī)劃問(wèn)題,對(duì)原來(lái)的多約束規(guī)劃問(wèn)題提出了一些凸化、凹化的方法,這樣這些多約束的規(guī)劃問(wèn)題可以被轉(zhuǎn)化為一些凹規(guī)劃、反凸規(guī)劃同題。